#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn],b[maxn];
LL dp[maxn][2];
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL n,c;cin>>n>>c;
  for(LL i=1;i<n;i++) cin>>a[i];
  for(LL j=1;j<n;j++) cin>>b[j];
  dp[0][0]=0;dp[0][1]=0x3f3f3f3f;
  for(LL i=1;i<n;i++){
      dp[i][1]=min(dp[i-1][1],dp[i-1][0]+c)+b[i];
      dp[i][0]=min(dp[i-1][1],dp[i-1][0])+a[i];
  }
  for(LL i=0;i<n;i++){
    cout<<min(dp[i][0],dp[i][1])<<" ";
  }
  cout<<"\n";
return 0;
}
